Realisability for infinitary intuitionistic set theory
نویسندگان
چکیده
We introduce a realisability semantics for infinitary intuitionistic set theory that is based on Ordinal Turing Machines (OTMs). show our notion of OTM-realisability sound with respect to certain systems logic, and all axioms Kripke-Platek are realised. Finally, we use variant the propositional admissible rules (finitary) exactly logic.
منابع مشابه
The Intuitionistic Alternative Set Theory
Lano, K., The intuitionistic alternative set theory, Annals of Pure and Applied Logic 59 (1993) 141-156. The Alternative Set Theory, as defined in Vopenka and Sochor, demonstrates how a set theory which avoids actually infinite sets can serve as a framework for much of classical mathematics. This paper defines a theory which can serve as an intuitionistic analogue of AST, and examines motivatio...
متن کاملEffecivity properties of intuitionistic set theory
Let us consider two-sorted intuitionistic set theory ZFI2 with sort 0 for natural numbers and sort 1 for sets. We shall show that well-known Church rule with parameters of sort 1 is admissible in ZFI2 in some rather strong sense, and get from this point the admissibility of Markov rule with all parameters in ZFI2, and also DP and numerical EP with set parameters for it in the same sense.
متن کاملLifschitz realizability for intuitionistic Zermelo-Fraenkel set theory
A variant of realizability for Heyting arithmetic which validates Church’s thesis with uniqueness condition, but not the general form of Church’s thesis, was introduced by V. Lifschitz in [15]. A Lifschitz counterpart to Kleene’s realizability for functions (in Baire space) was developed by van Oosten [19]. In that paper he also extended Lifschitz’ realizability to second order arithmetic. The ...
متن کاملInternalising modified realisability in constructive type theory
A modified realisability interpretation of infinitary logic is formalised and proved sound in constructive type theory (CTT). The logic considered subsumes first order logic. The interpretation makes it possible to extract programs with simplified types and to incorporate and reason about them in CTT. 1 Modified realisability Modified realisability interpretation is a well-known method for givi...
متن کاملInfinitary stability theory
We introduce a new device in the study of abstract elementary classes (AECs): Galois Morleyization, which consists in expanding the models of the class with a relation for every Galois (orbital) type of length less than a fixed cardinal κ. We show: Theorem 0.1 (The semantic-syntactic correspondence). An AEC K is fully (< κ)-tame and type short if and only if Galois types are syntactic in the Ga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2023
ISSN: ['0168-0072', '1873-2461']
DOI: https://doi.org/10.1016/j.apal.2023.103259